Scheduling Problems with Exponential Learning Functions
نویسندگان
چکیده
In this paper, we consider the scheduling problems with exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of the sum of the normal processing times of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the quadratic job completion times, the total weighted completion time and the maximum lateness. For some special single machine problems and flow shop problems, we show that the problems can be solved in polynomial time.
منابع مشابه
An Improved Particle Swarm Optimizer Based on a Novel Class of Fast and Efficient Learning Factors Strategies
The particle swarm optimizer (PSO) is a population-based metaheuristic optimization method that can be applied to a wide range of problems but it has the drawbacks like it easily falls into local optima and suffers from slow convergence in the later stages. In order to solve these problems, improved PSO (IPSO) variants, have been proposed. To bring about a balance between the exploration and ex...
متن کاملExponential membership function and duality gaps for I-fuzzy linear programming problems
Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...
متن کاملJob Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardness of the makespan minimization problem with arbitrary job release times. For decreasing functions, maximum lateness minimization problem is proved to be strongly NP-hard and total weighted completion time minimization...
متن کاملگسترش روش بدون شبکه توابع پایه نمایی برای حل مسائل تکین ورق
: Existence of singular points inside the solution domain or on its boundary deteriorates the accuracy and convergence rate of numerical methods. This phenomenon usually happens due to discontinuities in the boundary conditions or abrupt changes in the domain shape. This study has focused on the solution of singular plate problems using the exponential basis functions method. In this method, un...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کامل